Facets for the Maximum Common Induced Subgraph Problem Polytope
نویسندگان
چکیده
This paper presents some strong valid inequalities for the Maximum Common Induced Subgraph Problem (MCIS) and the proofs that the inequalities are facet-defining under certain conditions. TheMCIS is an NP-hard problem and, therefore, no polynomial time algorithm is known to solve it. In this context, the study of its polytope can help in the development of more efficient branch-and-bound and branch-and-cut algorithms.
منابع مشابه
Polyhedral study of the maximum common induced subgraph problem
In this paper we present an exact algorithm for the Maximum Common Induced Subgraph Problem (MCIS) by addressing it directly, using Integer Programming (IP) and polyhedral combinatorics. We study the MCIS polytope and introduce strong valid inequalities, some of which we prove to define facets. Besides, we show an equivalence between our IP model for MCIS and a well-known formulation for the Ma...
متن کاملNew facets for the planar subgraph polytope
This paper describes certain facet classes for the planar subgraph polytope. These facets are extensions of Kuratowski facets and are of the form 2x(U)+x(E(G)\U) ≤ 2|U |+|E(G)\U | −2 where the edge set U varies and can be empty. Two of the new types of facets complete the class of extended subdivision facets, explored by Jünger and Mutzel. In addition, the other types of facets consist of a new...
متن کاملThe maximum k-colorable subgraph problem and orbitopes
Given an undirected node-weighted graph and a positiveinteger k, the maximum k-colorable subgraph problem is to select ak-colorable induced subgraph of largest weight. The natural integerprogramming formulation for this problem exhibits a high degree ofsymmetry which arises by permuting the color classes. It is well knownthat such symmetry has negative effects on the perform...
متن کاملA Polyhedral Approach to Planar Augmentation and Related Problems
Given a planar graph G the planar biconnectivity augmen tation problem is to add the minimum number of edges to G such that the resulting graph is still planar and biconnected Given a nonplanar and biconnected graph the maximum planar biconnected subgraph problem consists of removing the minimum number of edges so that planarity is achieved and biconnectivity is maintained Both problems are imp...
متن کاملFacet Generating Techniques
Given a polyhedron P which is of interest, a major goal of polyhedral combinatorics is to find classes of essential, i.e. facet inducing inequalities which describe P . In general this is a difficult task. We consider the case in which we have knowledge of facets for a face F of P , and present some general theory and methods for exploiting the close relationship between such polyhedra in order...
متن کامل